منابع مشابه
Increments of Random Partitions
For any partition of {1, 2, . . . , n} we define its increments Xi, 1 ≤ i ≤ n by Xi = 1 if i is the smallest element in the partition block that contains it, Xi = 0 otherwise. We prove that for partially exchangeable random partitions (where the probability of a partition depends only on its block sizes in order of appearance), the law of the increments uniquely determines the law of the partit...
متن کاملSkip-free Random Walks with Markovian Increments
Let (ξk, k ≥ 0) be a Markov chain on {−1, +1} with ξ0 = 1 and transition probabilities P (ξk+1 = 1| ξk = 1) = a and P (ξk+1 = −1| ξk = −1) = b < a. Set X0 = 0, Xn = ξ1 + · · ·+ ξn and Mn = max0≤k≤n Xk. We prove that the process 2M − X has the same law as that of X conditioned to stay non-negative. Pitman’s representation theorem [19] states that, if (Xt, t ≥ 0) is a standard Brownian motion and...
متن کاملRANDOM WALKS WITH k-WISE INDEPENDENT INCREMENTS
We construct examples of a random walk with pairwise-independent steps which is almost-surely bounded, and for any m and k a random walk with k-wise independent steps which has no stationary distribution modulo m.
متن کاملPartially Exchangeable Random Partitions
A random partition of the positive integers is called partially exchangeable if for each finite sequence of positive integers n,, ... , nk, the probability that the partition breaks the first n1 + + nk integers into k particular classes, of sizes nl,.. . ., nk in order of their first elements, has the same value p(nl,...,nk) for every possible choice of classes subject to the sizes constraint. ...
متن کاملRandom Sampling of Plane Partitions
This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are slightly superlinear: the complexity is O(n(lnn)3) in approximate-size sampling and O(n4/3) in exact-size sampling (under a real-arithmetic computation mode...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2006
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548305007455